Knowledge Graph (KG) strongly support the research of knowledge-driven artificial intelligence. Aiming at this fact, the existing technologies of knowledge graph and knowledge hypergraph were analyzed and summarized. At first, from the definition and development history of knowledge graph, the classification and architecture of knowledge graph were introduced. Second, the existing knowledge representation and storage methods were explained. Then, based on the construction process of knowledge graph, several knowledge graph construction techniques were analyzed. Specifically, aiming at the knowledge reasoning, an important part of knowledge graph, three typical knowledge reasoning approaches were analyzed, which are logic rule-based, embedding representation-based, and neural network-based. Furthermore, the research progress of knowledge hypergraph was introduced along with heterogeneous hypergraph. To effectively present and extract hyper-relational characteristics and realize the modeling of hyper-relation data as well as the fast knowledge reasoning, a three-layer architecture of knowledge hypergraph was proposed. Finally, the typical application scenarios of knowledge graph and knowledge hypergraph were summed up, and the future researches were prospected.

In Dynamically Tuned Gyroscope (DTG) system, traditional identification methods, including least square identification method and traditional frequency domain identification method, could not achieve acceptable identification fitness degree. To deal with this problem, outlier-eliminated frequency identification method was proposed. In consideration of the characteristics of DTG model structure and intrinsic colored noise, outlier-eliminated method was applied to DTG frequency domain identification. The experimental results indicate that outlier-eliminated frequency identification method, with a fitness degree above 90%, compared with both least square identification method and traditional frequency domain identification method, has a better performance. In addition, outlier-eliminated frequency identification method possesses of good repeatability and stability. Outlier-eliminated frequency identification method could improve the identification fitness degree of DTG system.

Aiming at the all-pairs shortest-path problem in the directed graph,a practical parallel algorithm,which based on the Floyd algorithm with an extended path array,was brought forward on 2-D mesh network.The planar evenly partition method was chosen for task division in this parallel algorithm.The parallel algorithm was implemented on MPI on NOW.The theoretical analysis and the experimental results prove that the parallel algorithm is an efficient and scalable algorithm.